全文获取类型
收费全文 | 102034篇 |
免费 | 5275篇 |
国内免费 | 4787篇 |
专业分类
化学 | 42980篇 |
晶体学 | 1174篇 |
力学 | 8003篇 |
综合类 | 402篇 |
数学 | 34553篇 |
物理学 | 24984篇 |
出版年
2023年 | 471篇 |
2022年 | 598篇 |
2021年 | 780篇 |
2020年 | 1133篇 |
2019年 | 1135篇 |
2018年 | 11194篇 |
2017年 | 11013篇 |
2016年 | 7297篇 |
2015年 | 2224篇 |
2014年 | 1860篇 |
2013年 | 2336篇 |
2012年 | 6173篇 |
2011年 | 12898篇 |
2010年 | 7410篇 |
2009年 | 7813篇 |
2008年 | 8490篇 |
2007年 | 10362篇 |
2006年 | 1791篇 |
2005年 | 2661篇 |
2004年 | 2587篇 |
2003年 | 2844篇 |
2002年 | 1903篇 |
2001年 | 958篇 |
2000年 | 899篇 |
1999年 | 637篇 |
1998年 | 513篇 |
1997年 | 428篇 |
1996年 | 468篇 |
1995年 | 333篇 |
1994年 | 277篇 |
1993年 | 252篇 |
1992年 | 185篇 |
1991年 | 168篇 |
1990年 | 146篇 |
1989年 | 132篇 |
1988年 | 110篇 |
1987年 | 100篇 |
1986年 | 101篇 |
1985年 | 90篇 |
1984年 | 70篇 |
1983年 | 60篇 |
1982年 | 57篇 |
1981年 | 52篇 |
1980年 | 51篇 |
1979年 | 48篇 |
1914年 | 45篇 |
1913年 | 40篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Sandra Ulrich Ngueveu Stéphane Caux Frédéric Messine Mouloud Guemri 《4OR: A Quarterly Journal of Operations Research》2017,15(4):407-430
In hybrid electric vehicles, the electrical powertrain system has multiple energy sources that it can gather power from to satisfy the propulsion power requested by the vehicle at each instant. This paper focusses on the minimization of the fuel consumption of such a vehicle, taking advantage of the different energy sources. Based on global optimization approaches, the proposed heuristics find solutions that best split the power requested between the multi-electrical sources available. A lower bounding procedure is introduced to validate the quality of the solutions. Computational results show a significant improvement over previous results from the literature in both the computing time and the quality of the solutions. 相似文献
992.
Frans J. C. T. de Ruiter Aharon Ben-Tal Ruud C. M. Brekelmans Dick den Hertog 《Computational Management Science》2017,14(1):45-66
In production-inventory problems customer demand is often subject to uncertainty. Therefore, it is challenging to design production plans that satisfy both demand and a set of constraints on e.g. production capacity and required inventory levels. Adjustable robust optimization (ARO) is a technique to solve these dynamic (multistage) production-inventory problems. In ARO, the decision in each stage is a function of the data on the realizations of the uncertain demand gathered from the previous periods. These data, however, are often inaccurate; there is much evidence in the information management literature that data quality in inventory systems is often poor. Reliance on data “as is” may then lead to poor performance of “data-driven” methods such as ARO. In this paper, we remedy this weakness of ARO by introducing a model that treats past data itself as an uncertain model parameter. We show that computational tractability of the robust counterparts associated with this extension of ARO is still maintained. The benefits of the new model are demonstrated by a numerical test case of a well-studied production-inventory problem. Our approach is also applicable to other ARO models outside the realm of production-inventory planning. 相似文献
993.
Jean-Pierre Desclés 《Logica Universalis》2017,11(1):105-119
Anselm of Cantorbery wrote Proslogion (1077–1078), where is formulated the famous ‘Unum argumentum’ about the existence of God. This argument was been disputed and criticized by numerous logicians from an extensional view point. The classical predicate logic is not able to give a formal frame to develop an adequate analysis of this argument. According to us, this argument is not an ontological proof; it analyses the meaning of the “quo nihil maius cogitari posit”, a characterization of God, and establish, by absurd, that “quod non posit cogitare non esse” by using the hypothesis: “to think in re” is taller than “to think in solo intelectu”. We discuss this relation and the difference between the meanings of the elementary predicates ‘to be in re’, ‘to be in intellectu’ and ‘to be in solo intellectu’. We propose a new logical approach of this ‘Unum argumentum’ of Anselm by using Curry’s Combinatory Logic (1958, 1973). Indeed, Combinatory Logic is an abstract applicative formalism of operators applied to operands; in this formalism, the predicates, viewed as specific operators, can be composed and can be transformed, by an intrinsic way, into more complex predicates, by means of abstract operators, called “combinators”, studied by Combinatory Logic. We show that this formalism is a logical frame where it becomes possible to discuss and to formulate cognitive representations of the meanings of predicates used inside of the ‘Unum argumentum’ and to explain how the argument runs. 相似文献
994.
Arnon Avron 《Logica Universalis》2017,11(3):297-315
A logic \(\mathbf{L}\) is called self-extensional if it allows to replace occurrences of a formula by occurrences of an \(\mathbf{L}\)-equivalent one in the context of claims about logical consequence and logical validity. It is known that no three-valued paraconsistent logic which has an implication can be self-extensional. In this paper we show that in contrast, there is exactly one self-extensional three-valued paraconsistent logic in the language of \(\{\lnot ,\wedge ,\vee \}\) for which \(\vee \) is a disjunction, and \(\wedge \) is a conjunction. We also investigate the main properties of this logic, determine the expressive power of its language (in the three-valued context), and provide a cut-free Gentzen-type proof system for it. 相似文献
995.
The paper provides a proof-theory (natural deduction and sequent calculus) for a negative presentation of classical logic based on a single primitive of exclusion (of variable arity), generalizing the known presentation via the binary ‘nand. The completeness is established via deductive equivalence to Gentzens NK/LK systems. 相似文献
996.
Alex Citkin 《Logica Universalis》2017,11(4):421-437
The paper studies admissibility of multiple-conclusion rules in positive logics. Using modification of a method employed by M. Wajsberg in the proof of the separation theorem, it is shown that the problem of admissibility of multiple-conclusion rules in the positive logics is equivalent to the problem of admissibility in intermediate logics defined by positive additional axioms. Moreover, a multiple-conclusion rule \(\mathsf {r}\) follows from a set of multiple-conclusion rules \(\mathsf {R}\) over a positive logic \(\mathsf {P}\) if and only if \(\mathsf {r}\) follows from \(\mathsf {R}\) over \(\mathbf {Int}+ \mathsf {P}\). 相似文献
997.
We generalize an important theorem of Fred Galvin from the Stone-Cˇech compactification βT of any discrete semigroup T to any compact Hausdorff right-topological semigroup with a dense topological center;and then apply it to Ellis' semigroups to prove that a point is distal if and only if it is IP*-recurrent, for any semiflow(T, X) with arbitrary compact Hausdorff phase space X not necessarily metrizable and with arbitrary phase semigroup T not necessarily cancelable. 相似文献
998.
Let L be a Schrdinger operator of the form L =-? + V acting on L~2(R~n), n≥3, where the nonnegative potential V belongs to the reverse Hlder class B_q for some q≥n. Let BMO_L(R~n) denote the BMO space associated to the Schrdinger operator L on R~n. In this article, we show that for every f ∈ BMO_L(R~n) with compact support, then there exist g ∈ L~∞(R~n) and a finite Carleson measure μ such that f(x) = g(x) + S_(μ,P)(x) with ∥g∥∞ + |||μ|||c≤ C∥f∥BMO_L(R~n), where S_(μ,P)=∫(R_+~(n+1))Pt(x,y)dμ(y, t),and Pt(x, y) is the kernel of the Poisson semigroup {e-~(t(L)~(1/2))}t0 on L~2(R~n). Conversely, if μ is a Carleson measure, then S_(μ,P) belongs to the space BMO_L(R~n). This extends the result for the classical John-Nirenberg BMO space by Carleson(1976)(see also Garnett and Jones(1982), Uchiyama(1980) and Wilson(1988)) to the BMO setting associated to Schrdinger operators. 相似文献
999.
Let G i be a closed Lie subgroup of U(n), Ω i be a bounded G i -invariant domain in C n which contains 0, and \(O{\left( {{\mathbb{C}^n}} \right)^{{G_i}}} = \mathbb{C}\), for i = 1; 2. If f: Ω1 → Ω2 is a biholomorphism, and f(0) = 0, then f is a polynomial mapping (see Ning et al. (2017)). In this paper, we provide an upper bound for the degree of such polynomial mappings. It is a natural generalization of the well-known Cartan’s theorem. 相似文献
1000.
The main purpose of this paper is to generalize the celebrated L~2 extension theorem of Ohsawa and Takegoshi in several directions: The holomorphic sections to extend are taken in a possibly singular hermitian line bundle, the subvariety from which the extension is performed may be non reduced, the ambient manifold is K¨ahler and holomorphically convex, but not necessarily compact. 相似文献